A Unifying Framework for Strong Structural Controllability

نویسندگان

چکیده

This article deals with strong structural controllability of linear systems. In contrast to the existing work, structured systems studied in this have a so-called zero/nonzero/arbitrary structure, which means that some entries are equal zero, arbitrary but nonzero, and remaining (zero or nonzero). We formalize terms pattern matrices, whose either fixed arbitrary. establish necessary sufficient algebraic conditions for full rank tests certain matrices. also give graph-theoretic condition property given matrix. makes use new color change rule is introduced article. Based on these two results, we then controllability. Moreover, relate our results those exist literature explain how generalize previous work.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zero forcing number, constrained matchings and strong structural controllability

The zero forcing number is a graph invariant introduced in order to study the minimum rank of the graph. In the first part of this paper, we first highlight that the computation of the zero forcing number of any directed graph (allowing loops) is NP-hard. Furthermore, we identify a class of directed trees for which the zero forcing number is computable in linear time. The second part of the pap...

متن کامل

Zero forcing number, constraint matchings and strong structural controllability

The zero forcing number is a graph invariant introduced in order to study the minimum rank of the graph. In the first part of this paper, we first highlight that the computation of the zero forcing number of any directed graph (allowing loops) is NP-hard. Furthermore, we identify a class of directed trees for which the zero forcing number is computable in linear time. The second part of the pap...

متن کامل

Strong Structural Controllability of Linear Time-Varying Systems

In this note we consider continuous-time systems ẋ(t) = A(t)x(t) + B(t)u(t) as well as discrete-time systems x(t + 1) = A(t)x(t) + B(t)u(t) whose coefficient matrices A and B are not exactly known. More precisely, all that is known about the systems is their nonzero pattern, i.e., the locations of the nonzero entries in the coefficient matrices. We characterize the patterns that guarantee contr...

متن کامل

A Unifying Framework for Conceptual Data Modelling Concepts a Unifying Framework for Conceptual Data Modelling Concepts

For succesful information systems development, conceptual data modelling is essential. Nowadays many techniques for conceptual data modelling exist, examples are NIAM, FORM, PSM, many (E)ER variants, IFO, and FDM. In-depth comparisons of concepts of these techniques is very diicult as the mathematical formalisations of these techniques, if existing at all, are very diierent. As such there is a ...

متن کامل

A Unifying Framework for ALP , CLP

This paper presents the TPCALP framework, a theorem-proving approach which aims to unify Abductive Logic Programming (ALP), Constraint Logic Programming (CLP) and Semantic Query Optimization (SQO). The framework combines the use of deenitions, as in ordinary logic programming, with the use of integrity constraints, as in ALP and SQO. The programmer can choose to represent knowledge in either fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2021

ISSN: ['0018-9286', '1558-2523', '2334-3303']

DOI: https://doi.org/10.1109/tac.2020.2981425